Modeling and Control of Rare Segments in BitTorrent with Epidemic Dynamics

Despite its existing incentives for leecher cooperation, BitTorrent file sharing fundamentally relies on the presence of seeder peers. Seeder peers essentially operate outside the BitTorrent incentives, with two caveats: slow downlinks lead to increased numbers of “temporary” seeders (who left their console, but will terminate their seeder role when they return), and the copyright liability boon that file segmentation offers for permanent seeders. Using a simple epidemic model for a two-segment BitTorrent swarm, we focus on the BitTorrent rule to disseminate the (locally) rarest segments first. With our model, we show that the rarest-segment first rule minimizes transition time to seeder (complete file acquisition) and equalizes the segment populations in steady-state. We discuss how alternative dissemination rules may beneficially increase file acquisition times causing leechers to remain in the system longer (particularly as temporary seeders). The result is that leechers are further enticed to cooperate. This eliminates the threat of extinction of rare segments which is prevented by the needed presence of permanent seeders. Our model allows us to study the corresponding trade-offs between performance improvement, load on permanent seeders, and content availability, which we leave for future work. Finally, interpreting the two-segment model as one involving a rare segment and a “lumped” segment representing the rest, we study a model that jointly considers control of rare segments and different uplinks causing “choking,” where high-uplink peers will not engage in certain transactions with low-uplink peers. ∗A shorter version of this paper that did not include the N -segment lumped model was presented in May 2011 at IEEE ICC, Kyoto. †C. Griffin is the with Applied Research Laboratory, Penn State University, University Park, PA 16802, E-mail: [email protected] ‡G. Kesidis is the with Depts. of Electrical Engineering and Computer Science and Engineering, Penn State University, University Park, PA 16802, E-mail: [email protected] §P. Antoniadis is with the Communications Systems Group, ETH Zurich, E-mail: [email protected] ¶S. Fdida are with the Computer Science Dept., Univ. Pierre & Marie Curie (LIP6), [email protected] 1 ar X iv :1 30 6. 31 60 v1 [ cs .N I] 1 3 Ju n 20 13